曲面相机阵列多分辨成像方法

针对现有成像系统因数据冗余而无法兼顾大视场、高分辨、高效性的问题,结合人眼视网膜变分辨成像和并列式复眼成像原理,设计一种多分辨率成像的复合仿生成像系统.该成像系统按照球面和平面兼顾的曲面布局方式,利用11个相机镜头构建相机阵列,组成了四个等级分辨率的子眼拍摄模块.通过物距100 m的远景实验和物距10 m的近景实验发现,该系统在实现高分辨成像的同时,获得总视场达150.8°×37.8°.多分辨率成像实验结果表明,该系统获取的图像的分辨率从中心视场到边缘视场逐渐降低,并且相较于中心清晰全视场成像,四级分辨率成像的拼接图像数据量减少了17.2倍的数据冗余.     

An inequality connecting entropy distance,Fisher Information and large deviations

In this paper we introduce a new generalisation of the relative Fisher Information for Markov jump processes on a finite or countable state space, and prove an inequality which connects this object with the relative entropy and a large deviation rate functional. In addition to possessing various favourable properties, we show that this generalised Fisher Information converges to the classical Fisher Information in an appropriate limit. We then use this generalised Fisher Information and the aforementioned inequality to qualitatively study coarse-graining problems for jump processes on discrete spaces.     

The effects of resource limitation and consensual incentives on cooperation

Exploring the evolution of cooperation has been one of the most challenging topics and attracted increasing attention in various realms. Hereby, we institute an analytic model where the relationship between the common benefits and contributions is the typical saturation nonlinearity. We investigate the evolutionary dynamics of cooperation with and without consensual incentives respectively. The population always evolves to full defection when the incentives are absent. Cooperation, however, can be promoted by consensual incentives when the degree of cooperators' preferences for incentives is great. There exists an intermediate amount of resources at which the positive effect of consensual incentives on cooperation is minimized. Furthermore, there is a U-shape relationship between the degree of cooperators' preference for an incentive and the evolution of cooperation. A greater basin of full cooperation can be induced when the cooperators' preference for reward is more pronounced than that for punishment.     

Price coordination in distribution channels: A dynamic perspective

In this study, we investigate two important questions related to dynamic pricing in distribution channels: (i) Are coordinated pricing decisions efficient in a context where prices have carry-over effects on demand? (ii) Should firms practice a skimming or a penetration strategy if they choose to coordinate or to decentralize their activities? To answer these questions, we consider a differential game that takes place in a bilateral monopoly where the past retail prices paid by consumers contribute to the building of a reference price. The latter is used by consumers as a benchmark to evaluate the value of the product, and by firms to decide whether to adopt a skimming or a penetration strategy.     

大斯托克斯位移远红光至近红外荧光探针用于检测肝损伤过程中过氧化亚硝酸盐的动态变化

肝损伤是影响公众健康的重大问题之一, 已经引起了人们越来越多的关注. 而过表达的过氧化亚硝酸盐(ONOO^?)在肝损伤等疾病的发病机制中起着重要作用, 被认为是一种与早期肝损伤密切相关的生物活性分子. 因此, 为了探究ONOO^?在肝损伤过程中的作用, 开发可以实现肝损伤过程中ONOO^?高选择性和实时检测的分析方法具有重要意义. 本文报道了一种具有大斯托克斯位移的远红光至近红外(FR-NIR)ONOO^?荧光探针. 由于该探针具有大的斯托克斯位移, 可以有效消除光谱重叠和自吸收的干扰, 从而显著提高成像的信噪比. 此外, 该探针对ONOO^?具有高的灵敏度(检出限为25.8 nmol/L)和良好的选择性, 被成功用于药物诱导肝损伤过程中ONOO^?信号的成像检测.     

Heavy tails for an alternative stochastic perpetuity model

In this paper we consider a stochastic model of perpetuity-type. In contrast to the classical affine perpetuity model of Kesten (1973) and Goldie (1991) all discount factors in the model are mutually independent. We prove that the tails of the distribution of this model are regularly varying both in the univariate and multivariate cases. Due to the additional randomness in the model the tails are not pure power laws as in the Kesten–Goldie setting but involve a logarithmic term.     

Meyniel's conjecture holds for random d‐regular graphs

In the game of cops and robber, the cops try to capture a robber moving on the vertices of the graph. The minimum number of cops required to win on a given graph G is called the cop number of G. The biggest open conjecture in this area is the one of Meyniel, which asserts that for some absolute constant C, the cop number of every connected graph G is at most . In a separate paper, we showed that Meyniel's conjecture holds asymptotically almost surely for the binomial random graph. The result was obtained by showing that the conjecture holds for a general class of graphs with some specific expansion‐type properties. In this paper, this deterministic result is used to show that the conjecture holds asymptotically almost surely for random d‐regular graphs when d = d(n) ≥ 3.     

On the non-emptiness of the one-core and the bargaining set of committee games

We study the committee decision making process using game theory. Shenoy  [15] introduced two solution concepts: the one-core and the bargaining set, and showed that the one-core of a simple committee game is nonempty if there are at most four players. We extend this result by proving that whether the committee is simple or not, as far as there are less than five players, the one-core is nonempty. This result also holds for the bargaining set.     

Bounded stationary reflection II

Bounded stationary reflection at a cardinal λ is the assertion that every stationary subset of λ reflects but there is a stationary subset of λ that does not reflect at arbitrarily high cofinalities. We produce a variety of models in which bounded stationary reflection holds. These include models in which bounded stationary reflection holds at the successor of every singular cardinal $\mu >{\mathrm{?}}_{\omega }$ and models in which bounded stationary reflection holds at ${\mu }^{+}$ but the approachability property fails at μ.